Add various categories with subobject classifiers - #371
Merged
Merged
Conversation
ScriptRaccoon
force-pushed
the
empty-or-finite-pairs-of-sets
branch
from
September 14, 2026 20:17
31c216c to
19a72ed
Compare
ScriptRaccoon
force-pushed
the
empty-or-finite-pairs-of-sets
branch
7 times, most recently
from
September 21, 2026 09:25
8ecf9a2 to
b8d4fd3
Compare
ScriptRaccoon
force-pushed
the
empty-or-finite-pairs-of-sets
branch
from
September 24, 2026 06:10
ae8ee9a to
c240d3f
Compare
ScriptRaccoon
force-pushed
the
empty-or-finite-pairs-of-sets
branch
from
September 24, 2026 06:34
c240d3f to
067b0bd
Compare
…d cototal proofs but the properties are not added yet
ScriptRaccoon
force-pushed
the
empty-or-finite-pairs-of-sets
branch
from
September 25, 2026 17:58
1ad571a to
16aec30
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds various examples of categories with subobject classifiers and finite limits*, while not satisfying some other properties. The goal is to reduce the number of missing combinations, cf. this milestone. The categories are listed below. Most of their properties have been decided; only the question if F(I)-Set is cototal remains open for now.
*This is currently included in the definition of a subobject classifier, but might change later (#370).
The category of finite-or-empty pairs of sets
This is a rather random category, the full subcategory of Set × Set consisting of pairs (A,B) where A is empty or B is finite. It serves as an example of a category with a subobject classifier, but without binary coproducts.
All properties have been decided.
The category of directed graphs with finite components
This is the full subcategory of DiGraph consisting of coproducts of finite directed graphs. It is an example of a category with a subobject classifier, but without coequalizers.
All properties have been decided.
The category of sequences of sets
This is the functor category [(N,≤),Set]. It shares exactly the same recorded properties (currently) as the Sierpinski topos Mor(Set). (But they are not equivalent, since for example the Sierpinski topos has finitely many subterminals, but the category of sequences has infinitely many.) In particular, all properties have been decided, and no new combinations are witnessed. I have added this category to prepare for the next example.
The category of connected sequences of sets
We also add the full subcategory of [(N,≤),Set] consisting of connected sequences$X_0 \to X_1 \to \cdots$ , meaning that $colim_n X_n$ is a singleton. It has been suggested by Jonas Frey at mathoverflow and provides an example of a category with a subobject classifier, but without initial object (and no binary copowers, hence also no binary coproducts, just like the first category in the list).
All properties have been decided (this was a lot of work).
The category of Z-sets
This category is an instance of the category of M-sets, but the difference is that the property of being semi-strongly connected can be decided (it is not). It turns out that it has exactly the same properties as the Jónsson-Tarski topos (w.r.t. the recorded properties). Thus, all properties have been decided, no new combinations are witnessed, but this category prepares for the next example.
The category of finite Z-sets
This category is an example of a category with a subobject classifier, in fact even an elementary topos, without a cogenerator (and also without a generator, but for this we already knew several examples).
All properties have been decided.
The category of F(I)-sets
Here, F(I) is a large free group. The category of F(I)-sets provides an example of a category with a subobject classifier, in fact a complete and cocomplete elementary topos, that does not have a cogenerating collection.
All properties except for one have been designed: if it is cototal. This appears to be a very difficult problem.
New combinations
In total, the categories satisfy 72 new combinations. The number of missing combinations goes down from 393 to 321.